Parallel 'Go with the Winners' Algorithms in the LogP Model
نویسندگان
چکیده
We parallelize the ‘Go with the winners’ algorithm of Aldous and Vazirani [1] and analyze the resulting parallel algorithm in the LogP-model [4]. The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.
منابع مشابه
Fast Parallel Sorting Under LogP: Experience with the CM-5
In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP characterizes the performance of modern parallel machines with a small set of parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). We develop implementations of these algorithms in Split-C, a parallel extension to...
متن کاملModeling Parallel Sorts with LogP on the CM-5
In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP characterizes the performance of modern parallel machines with a small set of parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). We develop implementations of these algorithms in Split-C, a parallel extension to...
متن کاملAn Approach to Machine-Independent Parallel Programming
Currently, many parallel algorithms are deened for shared-memory architectures. The prefered machine model for designing these algorithms is the PRAM. However, this model does not take into account properties of existing architectures. Recently, Culler et al. deened the LogP machine model which better reeects the behaviour of massively parallel computers. We discuss an important class of progra...
متن کاملEfficient Parallelization of 2D Ising Spin Systems
(Abstract) The problem of efficient parallelization of 2D Ising spin systems requires realistic algorithmic design and implementation based on an understanding of issues from computer science and statistical physics. In this work, we not only consider fundamental parallel computing issues but also ensure that the major constraints and criteria of 2D Ising spin systems are incorporated into our ...
متن کاملScheduling tree-structured programs in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimum-length schedules for treestructured programs in the LogP model. This problem is proved to be NP-hard, even for outtrees of height two in LogP models with an...
متن کامل